Routing Elastic Demands: a Polymorphism Based Metaheuristic Scheme

We present here a Demand Maximizing Circuit Problem, which involves time elastic demands, and which is related to applications of Network Synthesis to the design of urban public transportation systems. This problem consists in the optimization, on some irregular domain, of some quantity whose computation involves heavy computational costs. We propose a specific metaheuristic Pursuit scheme, based upon the application to the original problem of a multiform rewriting process. We present and discuss various interpretations of this scheme together with practical experimentations. The whole paper is an extension of a work which was presented during the LT ‘2007 conference in Sousse.